On a nonlinear congruential pseudorandom number generator
نویسندگان
چکیده
A nonlinear congruential pseudorandom number generator with modulus M = 2w is proposed, which may be viewed to comprise both linear as well as inversive congruential generators. The condition for it to generate sequences of maximal period length is obtained. It is akin to the inversive one and bears a remarkable resemblance to the latter.
منابع مشابه
On the Linear Complexity Profile of Nonlinear Congruential Pseudorandom Number Generators with Dickson Polynomials
Linear complexity and linear complexity profile are important characteristics of a sequence for applications in cryptography and MonteCarlo methods. The nonlinear congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. Recently, a weak lower bound on the linear complexity profile of a general nonlinear congruential pseudor...
متن کاملPseudorandom Number Generation by Inversive Methods
The classical linear congruential method for generating uniform pseudorandom numbers has some deficiencies that can render them useless for some simulation problems. This fact motivated the design and analysis of nonlinear congruential methods for the generation of pseudorandom numbers. Inversive methods are an interesting and very promising approach to produce uniform pseudorandom numbers. We ...
متن کاملExponential sums of nonlinear congruential pseudorandom number generators with Rédei functions
The nonlinear congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. We give new bounds of exponential sums with sequences of iterations of Rédei functions over prime finite fields, which are much stronger than bounds known for general nonlinear congruential pseudorandom number generators. © 2007 Elsevier Inc. All rights ...
متن کاملInversive Congruential Pseudorandom Numbers Avoid the Planes
Nonlinear congruential pseudorandom number generators based on inversions have recently been introduced and analyzed. These generators do not show the lattice structure of the widely used linear congruential method. In the present paper it is proved that the points formed by d consecutive pseudorandom numbers of an inversive congruential generator with prime modulus possess an even stronger pro...
متن کاملStatistical Independence of a New Class of Inversive Congruential Pseudorandom Numbers
Linear congruential pseudorandom numbers show several undesirable regularities which can render them useless for certain stochastic simulations. This was the motivation for important recent developments in nonlinear congruential methods for generating uniform pseudorandom numbers. It is particularly promising to achieve nonlinearity by employing the operation of multiplicative inversion with re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 65 شماره
صفحات -
تاریخ انتشار 1996